Complexity , Linear Optimization , and lower bounds for the nonnegative rank of matrices ( Dagstuhl Seminar 13082 )
نویسندگان
چکیده
This report documents the program and the outcomes of Dagstuhl Seminar 13061 “Fault Prediction, Localization, and Repair”. Software debugging, which involves localizing, understanding, and removing the cause of a failure, is a notoriously difficult, extremely time consuming, and human-intensive activity. For this reason, researchers have invested a great deal of effort in developing automated techniques and tools for supporting various debugging tasks. In this seminar, we discussed several different tools and techniques that aid in the task of Fault Prediction, Localization and Repair. The talks encompassed a wide variety of methodologies for fault prediction and localizing, such as statistical fault localization, core dump analysis, taint analysis, program slicing techniques, dynamic fault-comprehension techniques, visualization techniques, combining hardware and software instrumentation for fault detection and failure prediction, and verification techniques for checking safety properties of programs. For automatically (or semi-automatically) repairing faulty programs, the talks covered approaches such as automated repair based on symbolic execution, constraint solving and program synthesis, combining past fix patterns, machine learning and semantic patch generation techniques, a technique that exploits the intrinsic redundancy of reusable components, a technique based on memory-access patterns and a coverage matrix, a technique that determines a combination of mutual-exclusion and order relationships that, once enforced, can prevent buggy interleaving. In addition, this seminar also explored some unusual topics such as Teaching Debugging, using Online Courses. Another interesting topic covered was the low representation of females in computing, and how programming and debugging tools interact with gender differences. Seminar 03.–08. February, 2013 – www.dagstuhl.de/13061 1998 ACM Subject Classification D.3 Programming Languages, D.2 Software Engineering, D.2.5 Testing and Debugging, D.2.4 Software/Program Verification, F.3 Logics and Meanings of Programs, F.3.1 Specifying and Verifying and Reasoning about Programs
منابع مشابه
Dagstuhl Report 13082: Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices
This report documents the program and the outcomes of Dagstuhl Seminar 13082 “Communication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices”, held in February 2013 at Dagstuhl Castle.
متن کاملCommunication Complexity, Linear Optimization, and lower bounds for the nonnegative rank of matrices (Dagstuhl Seminar 13082)
متن کامل
Lower bounds on nonnegative rank via nonnegative nuclear norms
The nonnegative rank of an entrywise nonnegative matrix A ∈ Rm×n + is the smallest integer r such that A can be written as A = UV where U ∈ Rm×r + and V ∈ Rr×n + are both nonnegative. The nonnegative rank arises in different areas such as combinatorial optimization and communication complexity. Computing this quantity is NP-hard in general and it is thus important to find efficient bounding tec...
متن کاملInformation-theoretic approximations of polytopes
Common information was introduced by Wyner [1975] as a measure of dependence of two random variables. This measure has been recently resurrected as a lower bound on the logarithm of the nonnegative rank of a nonnegative matrix in Jain et al. [2013], Braun and Pokutta [2013]. Lower bounds on nonnegative rank have important applications to several areas such as communication complexity and combin...
متن کاملLimitations of convex programming: lower bounds on extended formulations and factorization ranks (Dagstuhl Seminar 15082)
This report documents the program and the outcomes of Dagstuhl Seminar 15082 “Limitations of convex programming: lower bounds on extended formulations and factorization ranks” held in February 2015. Summaries of a selection of talks are given in addition to a list of open problems raised during the seminar. Seminar February 15–20, 2015 – http://www.dagstuhl.de/15082 1998 ACM Subject Classificat...
متن کامل